On the worst-case complexity of the silhouette of a polytope
نویسندگان
چکیده
We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.
منابع مشابه
On the theoretical complexity of the silhouette of a polyhedron
We study conditions under which the silhouette of a polyhedron is guaranted to be sublinear, either on average or in the worst case, and give some counter-examples when not.
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملH∞ Guaranteed Cost Computation for Uncertain Time-Delay Systems
This paper presents a less conservative approach to compute, with any prescribed accuracy, the H∞ guaranteed cost of time-delay continuous-time linear time-invariant systems subjected to polytopic uncertainties. The proposed analysis approach is based on a branch-and-bound algorithm that incorporates a recent LMI-based analysis formulation and a new polytope partition strategy. In the branch-an...
متن کامل